1913B - Swap and Delete - CodeForces Solution

#include <iostream>
#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fr(i,a,b) for(int i=a; i<b;i++)
#define loop(x,b) for(int x=0;x<b;x++)
#define all(x) (x).begin(),(x).end()

#define MOD 1000000007
#define inf (1LL <<60)

using namespace std;

void precal(){

}

void solve() {
    string str;
    cin >> str;
    int zero = count(str.begin(), str.end(), '0');
    int one = count(str.begin(), str.end(), '1');
    int size = str.length();
    int i = 0;

    loop(i, size) {
        if (str[i] == '1')
            zero--;
        else
            one--;

        if (min(zero, one) < 0) {
            cout << size - i << endl;
            return;  // Exit the function once the condition is met
        }
    }

    cout << 0 << endl;
}
                           

int main(){
    fast_io;
    
    precal();
    
    int t; cin>>t;

    for(int i=0;i<t;i++){
        solve();
    }

    return 0;


}